Experimenting with Small Changes in Conflict-Driven Clause Learning Algorithms
نویسندگان
چکیده
–Conflict-Driven Clause Learning: – are believed to be well-known: ∗ They embed dynamic heuristics [6, 3], learning [7], restarts [4, 1] and lazy data structures [6]. ∗ (efficient) SAT Solvers can be written from scratch in less than a thousand lines of code. – are not so well-known: ∗Who really understand the underlying mechanisms? ∗No real experimental studies: Progresses have been made with extensive tests “only” ∗What is a good learnt clause? When to forget? When to restart?
منابع مشابه
Experimenting Small Changes in Conflict-Driven Clause Learning Algorithms
Experimentation of new algorithms is the usual companion section of papers dealing with SAT. However, the behavior of those algorithms is so unpredictable that even strong experiments (hundreds of benchmarks, dozen of solvers) can be still misleading. We present here a set of experiments of very small changes of a canonical Conflict Driven Clause Learning (CDCL) solver and show that even very c...
متن کاملCompressing Propositional Refutations Using Subsumption
We describe ongoing work on the use of subsumption to remove redundant inferences from propositional resolution refutation proofs of the style generated by conflict driven clause learning SAT solvers. This is used for faster LCF-style proof replay in interactive theorem provers. There may also be an application in the extraction of small unsatisfiable cores.
متن کاملSAT solving techniques: a bibliography
We present a selective bibliography about efficient SAT solving, focused on optimizations for the CDCL-based algorithms.
متن کاملPredicting Learnt Clauses Quality in Modern SAT Solvers
Beside impressive progresses made by SAT solvers over the last ten years, only few works tried to understand why Conflict Directed Clause Learning algorithms (CDCL) are so strong and efficient on most industrial applications. We report in this work a key observation of CDCL solvers behavior on this family of benchmarks and explain it by an unsuspected side effect of their particular Clause Lear...
متن کاملPRuning Through Satisfaction
The classical approach to solving the satisfiability problem of propositional logic prunes unsatisfiable branches from the search space. We prune more agressively by also removing certain branches for which there exist other branches that are more satisfiable. This is achieved by extending the popular conflict-driven clause learning (CDCL) paradigm with so-called PR-clause learning. We implemen...
متن کامل